Patterson-Wiedemann construction revisited
نویسندگان
چکیده
In 1983, Patterson and Wiedemann constructed Boolean functions on n = 15 input variables having nonlinearity strictly greater than 2n−1−2 n−1 2 . Construction of Boolean functions on odd number of variables with such high nonlinearity was not known earlier and also till date no other construction method of such functions are known. We note that the PattersonWiedemann construction can be understood in terms of interleaved sequences as introduced by Gong in 1995 and subsequently these functions can be described as repetitions of a particular binary string. As example we elaborate the cases for n = 15, 21. Under this framework, we map the problem of finding Patterson-Wiedemann functions into a problem of solving a system of linear inequalities over the set of integers and provide proper reasoning about the choice of the orbits. This, in turn, reduces the search space. Similar analysis also reduces the complexity of calculating autocorrelation and generalized nonlinearity for such functions. In an attempt to understand the above construction from the group theoretic view point, we characterize the group of all GF (2)-linear transformations of GF (2ab) which acts on PG(2, 2a). Keyword : Boolean Function, Algebraic Approach, Nonlinearity, Autocorrelation, Generalized Nonlinearity.
منابع مشابه
New Construction for Balanced Boolean Functions with Very High Nonlinearity
In the past twenty years, there were only a few constructions for Boolean functions with nonlinearity exceeding the quadratic bound 2n−1 − 2(n−1)/2 when n is odd (we shall call them Boolean functions with very high nonlinearity). The first basic construction was by Patterson and Wiedemann in 1983, which produced unbalanced function with very high nonlinearity. But for cryptographic applications...
متن کاملIranian EFL Learners’ Motivation Construction: Integrative Motivation Revisited
Although Gardner and his associates’ work was most influential in the field of L2 motivation, from the early 1990s onwards, their work has been criticized for several reasons. Some researchers claimed that integrative and instrumental orientations were no longer able to convey the complexity of the L2 motivation construct. To examine this complexity, the present study attempted to investigate t...
متن کاملGeneralized Maiorana-McFarland Constructions for Almost Optimal Resilient Functions
In a recent paper [1], Zhang and Xiao describe a technique on constructing almost optimal resilient functions on even number of variables. In this paper, we will present an extensive study of the constructions of almost optimal resilient functions by using the generalized MaioranaMcFarland (GMM) construction technique. It is shown that for any given m, it is possible to construct infinitely man...
متن کاملConstruction of Nonlinear Boolean Functions with Important Cryptographic Properties
This paper addresses the problem of obtaining new construction methods for cryptographically significant Boolean functions. We show that for each positive integer m, there are infinitely many integers n (both odd and even), such that it is possible to construct n-variable, m-resilient functions having nonlinearity greater than 2− 2 n 2 . Also we obtain better results than all published works on...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- IACR Cryptology ePrint Archive
دوره 2003 شماره
صفحات -
تاریخ انتشار 2003